Constant-length substitutions and countable scrambled sets
نویسندگان
چکیده
منابع مشابه
Unavoidable Sets of Constant Length
A set of words X is called unavoidable on a given alphabet A if every infinite word on A has a factor in X. For k, q ≥ 1, let c(k, q) be the number of conjugacy classes of words of length k on q letters. An unavoidable set of words of length k on q symbols has at least c(k, q) elements. We show that for any k, q ≥ 1 there exists an unavoidable set of words of length k on q symbols having c(k, q...
متن کاملCohesive Sets: Countable and Uncountable
We show that many uncountable admissible ordinals (including some cardinals) as well as all countable admissible ordinals have cohesive subsets. Exactly which cardinals have cohesive subsets, however, is shown to depend on set-theoretic assumptions such as V=L or a large cardinal axiom. The study of recursion theory on the ordinals was initiated by Takeuti and then generalized by several others...
متن کاملCountable Sets and Hessenberg’s Theorem
The papers [20], [16], [3], [11], [9], [15], [5], [8], [7], [21], [19], [2], [1], [10], [22], [12], [13], [18], [14], [17], [4], and [6] provide the terminology and notation for this paper. For simplicity we follow the rules: X, Y are sets, D is a non-empty set, m, n, n1, n2, n3, m2, m1 are natural numbers, A, B are ordinal numbers, L, K, M , N are cardinal numbers, x is arbitrary, and f is a f...
متن کاملBorel Sets and Countable Models
We show that certain families of sets and functions related to a countable structure A are analytic subsets of a Polish space. Examples include sets of automorphisms, endomorphisms and congruences of A and sets of the combinatorial nature such as coloring of countable plain graphs and domino tiling of the plane. This implies, without any additional set-theoretical assumptions, i.e., in ZFC alon...
متن کاملStationary countable dense random sets
We study the probability theory of countable dense random subsets of (uncountably infinite) Polish spaces. It is shown that if such a set is stationary with respect to a transitive (locally compact) group of symmetries then any event which concerns the random set itself (rather than accidental details of its construction) must have probability zero or one. Indeed the result requires only quasi-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinearity
سال: 2004
ISSN: 0951-7715,1361-6544
DOI: 10.1088/0951-7715/17/3/005